Vandermonde sets and super-Vandermonde sets
نویسندگان
چکیده
Given a set T ⊆ GF(q), |T | = t, wT is defined as the smallest positive integer k for which ∑ y∈T y k 6= 0. It can be shown that wT ≤ t always and wT ≤ t − 1 if the characteristic p divides t. T is called a Vandermonde set if wT ≥ t−1 and a super-Vandermonde set if wT = t. This (extremal) algebraic property is interesting for its own right, but the original motivation comes from finite geometries. In this paper we classify small and large super-Vandermonde sets.
منابع مشابه
On almost small and almost large super-Vandermonde sets in GF(q)
A set T ⊂ GF(q), q = ph is a super-Vandermonde set if ∑y∈T yk = 0 for 0 < k < |T |. We determine the structure of super-Vandermonde sets of size p + 1 (almost small) and size q/p − 1 (almost large).
متن کاملLocating good points for multivariate polynomial approximation
Locating good points for multivariate polynomial approximation, in particular interpolation, is an open challenging problem, even in standard domains. One set of points that is always good, in theory, is the so-called Fekete points. They are defined to be those points that maximize the (absolute value of the) Vandermonde determinant on the given compact set. However, these are known analyticall...
متن کاملSuperresolution, the Recovery of Missing Samples, and Vandermonde Matrices on the Unit Circle
The purpose of this paper is to study the conditioning of complex Vandermonde matrices, in reference to applications such as superresolution and the problem of recovering missing samples in band-limited signals. The results include bounds for the singular values of Vandermonde matrices whose nodes are complex numbers on the unit circle. It is shown that, under certain conditions, such matrices ...
متن کاملPolynomial interpolation and cubature over polygons
We have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation. 2000 AMS subject classification: 65D05...
متن کاملLinear Projections of the Vandermonde Polynomial
An n-variate Vandermonde polynomial is the determinant of the n × n matrix where the ith column is the vector (1, xi, x 2 i , . . . , x n−1 i ) T . Vandermonde polynomials play a crucial role in the theory of alternating polynomials and occur in Lagrangian polynomial interpolation as well as in the theory of error correcting codes. In this work we study structural and computational aspects of l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 14 شماره
صفحات -
تاریخ انتشار 2008